Metric dimension of metric transform and wreath product
نویسندگان
چکیده
منابع مشابه
The metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملOn the metric dimension and fractional metric dimension for hierarchical product of graphs
A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...
متن کاملthe metric dimension and girth of graphs
a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...
متن کاملThe metric dimension of the lexicographic product of graphs
A set of vertices W resolves a graph G if every vertex is uniquely determined by its coordinate of distances to the vertices in W . The minimum cardinality of a resolving set of G is called themetric dimension of G. In this paper, we consider a graphwhich is obtained by the lexicographic product between two graphs. The lexicographic product of graphs G and H , which is denoted by G ◦ H , is the...
متن کاملThe Metric Dimension of the Composition Product of Graphs
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v, w1), d(v, w2), . . . , d(v, wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Carpathian Mathematical Publications
سال: 2019
ISSN: 2313-0210,2075-9827
DOI: 10.15330/cmp.11.2.418-421